A Parallel Algorithm For Anonymizing Large-scale Trajectory Data
نویسندگان
چکیده
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملParallel Spectral Clustering Algorithm for Large-Scale Community Data Mining
The spectral clustering algorithm has been shown to be very effective in finding clusters of non-linear boundaries. Unfortunately, spectral clustering suffers from the scalability problem in both memory use and computational time. In this work, we parallelize the algorithm by dividing both memory use and computation on distributed machines. Empirical study on some small datasets shows the accur...
متن کاملParallel Clustering Algorithm for Large-Scale Biological Data Sets
BACKGROUNDS Recent explosion of biological data brings a great challenge for the traditional clustering algorithms. With increasing scale of data sets, much larger memory and longer runtime are required for the cluster identification problems. The affinity propagation algorithm outperforms many other classical clustering algorithms and is widely applied into the biological researches. However, ...
متن کاملApriori-based algorithms for km-anonymizing trajectory data
The proliferation of GPS-enabled devices (e.g., smartphones and tablets) and locationbased social networks has resulted in the abundance of trajectory data. The publication of such data opens up new directions in analyzing, studying and understanding human behavior. However, it should be performed in a privacy-preserving way, because the identities of individuals, whose movement is recorded in ...
متن کاملa utility-based data replication algorithm in large scale data grids
data grids support access to widely distributed storage for large numbers of users accessing potentially many files. to enhance access time, replication at nearby sites may be used. data replication, a technique much investigated bydata grid researchers in past years creates multiple replicas offile and places them in conventional locations to shorten fileaccess times. one of the problems in da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM/IMS Transactions on Data Science
سال: 2020
ISSN: 2691-1922
DOI: 10.1145/3368639